Back to course home
0% completed
Vote For New Content
LinkedIn Medium
Rotate List (medium)
Solution: Rotate List
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Valid Triangle Number (medium)
Solution: Valid Triangle Number
Valid Parenthesis String (medium)
Solution: Valid Parenthesis String
Edit Distance (medium)
Solution: Edit Distance
Remove All Ones With Row and Column Flips II (medium)
Solution: Remove All Ones With Row and Column Flips II
Reverse Integer (medium)
Solution: Reverse Integer
Triplet Sum to Zero (medium)
Solution: Triplet Sum to Zero
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Decode Ways (medium)
Solution: Decode Ways
Quadruple Sum to Target (medium)
Solution: Quadruple Sum to Target
Next Permutation (medium)
Solution: Next Permutation
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Word Search (medium)
Solution: Word Search
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
House Robber II (medium)
Solution: House Robber II
Coin Change
Solution: Coin Change
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Merge Intervals (medium)
Solution: Merge Intervals
Number of Islands (easy)
Solution: Number of Islands
Longest Palindromic Subsequence (medium)
Solution: Longest Palindromic Subsequence
Kth Smallest Number (medium)
Solution: Kth Smallest Number
Maximum Product Subarray (medium)
Solution: Maximum Product Subarray
Same Tree (medium)
Solution: Same Tree
LinkedIn Hard
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Find Pivot Index (easy)
Problem Statement
Given an integer array nums, determine the pivot index of this array.
The pivot index divides the array in such a way that the sum of the numbers on its left side is exactly equal to the sum of the numbers on its right side.
If the index is at the beginning, the sum to its left is considered zero, similarly for an index at the end.
Return the leftmost pivot index. If no such index exists, return -1.
Examples
-
Example 1:
- Input:
[1, 2, 3, 4, 3, 2, 1] - Expected Output:
3 - Justification: The sum of the numbers to the left of index
3(1 + 2 + 3) is6, and the sum to its right (3 + 2 + 1) is also6.
- Input:
-
Example 2:
- Input:
[2, 1, 3] - Expected Output:
-1 - Justification: There is no pivot index that exists in the given array.
- Input:
-
Example 3:
- Input:
[1, 100, 50, -51, 1, 1] - Expected Output:
1 - Justification: The sum to the left of index
1is1, and the sum to its right (50 + (-51) + 1 + 1) is1.
- Input:
Try it yourself
Try solving this question here:
Java
. . . .
Who Should Take This Course?
Solution: Find Pivot Index
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself